On the Applicability of Post's Lattice

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

Model Checking for Modal Dependence Logic: An Approach through Post's Lattice

In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending modal logic by a the dependence atom dep(·). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using...

On the Development of Emil Post's Ideas in Structural Complexity Theory

Structural complexity theory is one of the branches of computer science. In this survey we will show how notions of a complete r.e. set and many-one reducibility from Post's 1944 paper innuenced the study of NP-complete languages in structural complexity theory.

On the Relative Complexity of Post's Classes

On lattice of basic z-ideals

  For an f-ring  with bounded inversion property, we show that   , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever  is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring  with bounded inversion property, we prove that  is a complemented...